System and method for large scale crowdsourcing of map data cleanup and correction

ABSTRACT

A system for large-scale crowd sourcing of map data cleanup and correction, comprising an application server that generates image data, sends image data to a user device, receives tagging data provided by the device user, and provides tags to a crowdsourced search and locate server based on tagging data from a user device, a crowdsourced search and locate server that receives tags from an application server, computes agreement and disagreement values and performs expectation-maximization analysis, and a map data server that stores and provides map data, and a method for estimating location and quality of a set of geolocation data.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims a benefit, and priority, to U.S. provisionalpatent application Ser. No. 61/977,079, filed on Apr. 8, 2014, titled“SYSTEM AND METHOD FOR LARGE SCALE CROWDSOURCING OF MAP DATA CLEANUP ANDCORRECTION”, the entire specification of which is incorporated herein byreference. The present application is also a continuation-in-part ofU.S. patent application Ser. No. 14/680,495, filed on Apr. 7, 2015,titled “SYSTEM AND METHOD FOR LARGE SCALE CROWDSOURCING OF MAP DATACLEANUP AND CORRECTION”, which claims a benefit, and priority, to U.S.provisional patent application Ser. No. 61/976,470, filed on Apr. 7,2014, titled “CROWDSOURCED FEATURE IDENTIFICATION ANDORTHORECTIFICATION”, the entire specification of which is incorporatedherein by reference. The present application is also acontinuation-in-part of U.S. patent application Ser. No. 14/680,495,filed on Apr. 7, 2015, titled “SYSTEM AND METHOD FOR LARGE SCALECROWDSOURCING OF MAP DATA CLEANUP AND CORRECTION”, which is acontinuation-in-part of U.S. patent application Ser. No. 14/049,199,titled “CROWDSOURCED SEARCH AND LOCATE PLATFORM”, filed on Oct. 8, 2013,which is a continuation of U.S. patent application Ser. No. 13/841,392,titled “CROWDSOURCED SEARCH AND LOCATE PLATFORM”, filed on Mar. 15,2013, which claims priority to U.S. provisional patent application Ser.No. 61/766,673, titled “CROWDSOURCED SEARCH AND LOCATE PLATFORM, filedon Feb. 19, 2013, the entire specification of each of which isincorporated in its entirety hereby by reference. The presentapplication is also a continuation-in-part of U.S. patent applicationSer. No. 14/680,495, filed on Apr. 7, 2015, titled “SYSTEM AND METHODFOR LARGE SCALE CROWDSOURCING OF MAP DATA CLEANUP AND CORRECTION”, whichis a continuation-in-part of U.S. patent application Ser. No.14/010,450, titled “CROWDSOURCED SEARCH AND LOCATE PLATFORM”, filed onAug. 26, 2013, which is a continuation of U.S. patent application Ser.No. 13/839,379, titled “CROWDSOURCED SEARCH AND LOCATE PLATFORM”, filedon Mar. 15, 2013, which claims priority to U.S. provisional patentapplication Ser. No. 61/766,644 titled “CROWDSOURCED SEARCH AND LOCATEPLATFORM”, filed on Feb. 19, 2013, the entire specification of each ofwhich is incorporated in its entirety hereby by reference. The presentapplication is also a continuation-in-part of U.S. patent applicationSer. No. 14/680,495, filed on Apr. 7, 2015, titled “SYSTEM AND METHODFOR LARGE SCALE CROWDSOURCING OF MAP DATA CLEANUP AND CORRECTION”, whichis a continuation-in-part of U.S. patent application Ser. No.14/049,189, titled “CROWDSOURCED IMAGE ANALYSIS PLATFORM”, filed on Oct.8, 2013, which is a continuation of U.S. patent application Ser. No.13/840,993, titled “CROWDSOURCED IMAGE ANALYSIS PLATFORM”, filed on Mar.15, 2013, which claims priority to U.S. provisional patent applicationSer. No. 61/766,677, titled “CROWDSOURCED IMAGE ANALYSIS PLATFORM”,filed on Feb. 19, 2013, the entire specification of each of which isincorporated in its entirety hereby by reference. The presentapplication is also a continuation-in-part of U.S. patent applicationSer. No. 14/680,495, filed on Apr. 7, 2015, titled “SYSTEM AND METHODFOR LARGE SCALE CROWDSOURCING OF MAP DATA CLEANUP AND CORRECTION”, whichis a continuation-in-part of U.S. patent application Ser. No. 13/840,173titled “SYSTEM AND METHOD FOR GEOLOCATION OF SOCIAL MEDIA POSTS”, filedon Mar. 15, 2013, which claims priority to U.S. provisional patentapplication Ser. No. 61/766,655, titled “SYSTEM AND METHOD FORGEOLOCATION OF SOCIAL MEDIA POSTS”, filed on Feb. 19, 2013, the entirespecification of each of which is incorporated in its entirety hereby byreference.

BACKGROUND OF THE INVENTION

Field of the Invention

The present invention is in the field of image analysis, and moreparticularly in the field of platforms for crowdsourcing open streetmapping activities, for example in the developing world.

Discussion of the State of the Art

Image analysis has been an important field of technology at least sincethe period of World War 2, when extensive use of image analysis,photogrammetry, and related technologies was used in conjunction withaerial photography for intelligence and bombing damage assessmentpurposes (among others). However, the extent of the use of imageanalysis (particularly image analysis of remotely-sensed images),particularly for identifying or locating targets of interest, has alwaysbeen limited by the need for highly-trained, specialized image analystsor interpreters. The need for specialized (and expensive) skills haslimited the use of image analysis to a correspondingly limited range ofapplications (notably military, homeland defense, and law enforcement).

The market for image analysis has also historically been limited by thehigh cost of obtaining images to analyze. In the military arena, thebenefits were sufficiently apparent that large numbers of militaryreconnaissance flights were made over regions of interest since WorldWar 2. But the cost of such flights virtually totally excluded allcommercial applications of image analysis. Starting in the 1970s withthe Landsat satellite, this began to change as low resolution satelliteimages became publicly available. A series of new satellites has openedup progressively more applications as the resolution, spectral coverage,geographic coverage, and cost per image have all continuously improved;accordingly, a significant market in commercial remote sensing imageryhas emerged. But even this market has been limited from achieving itsfull potential because of the still-present requirement for expensive,scarce image analysis talent. Some progress has been made in automatedimage analysis technologies, but for a vast range of current andpotential applications, large scale image analysis (such as would beneeded when analyzing satellite images of a large region) remains tooexpensive and too supply-constrained to use.

One common type of image analysis problem is the “search and locate”problem. In this problem, what is needed is to find and to preciselylocate one or more targets of interest. For example, in search andrescue, it may be important to find a missing plane using satelliteimagery. Another example is the finding and precise location ofwarships, tanks, or other military targets of interest. Less common butpromising applications include such things as assessing hurricane damageby finding and locating damaged buildings and infrastructure, findingand locating potentially important archeological sites (for instance, byidentifying possible ruins in deserts), and assessing the scope of arefugee problem by for example counting tents in an area of interest.

Recently, the notion of “crowdsourcing” (using very large numbers ofpeople, each doing a small part of a large task, to accomplish large ofcomplex tasks quickly at extremely low cost) has emerged, and a numberof crowdsourcing platforms have been implemented. Some of these addresstopics of broad general interest (for example, WIKIPEDIA™), and some aremore specialized (for example, GALAXYZOO™, where users are shown imagesof objects from the Hubble Space Telescope and asked to decide if theobject shown is a galaxy and, if so, what kind of galaxy it is). Mostcrowdsourcing platforms to date rely on volunteers to perform the work,although some (such as Amazon's Mechanical Turk) are commercial innature and pay for crowdsourced work. There have been two generalapproaches to managing crowdsourced work. In the first, a large, complexor repetitive task is broken up into many subtasks, with each subtaskbeing given to a single worker; as workers complete the subtasks, theresults are rolled up and the overall task is completed at low cost.Generally, various means are used to measure the quality or value of thetasks performed by each participant, so that over time a reputation orquality score can be assigned to each participant; in some cases, workis assigned based at least in part on these reputation or qualityscores. The work distribution and quality measurement approach is used,for example, by Amazon's Mechanical Turk platform. A second commonapproach to crowdsourcing is to use an essentially democratic process tohave a crowd decide a difficult question. The process is referred to as“democratic” because each participant simply votes on what theparticipants believes the answer to be (this is helpful forclassification problems such as that described above for GALAXYZOO™).

While aspects of both of these problems are relevant to the broad searchand locate application domain, neither of them is sufficient. Considerthe refugee assessment problem just described. The work distributionapproach can clearly be used to divide up the task for distribution tomany participants (typically volunteers). Similarly, the democraticapproach could be used by the platform to decide whether something is oris not a tent, based on the number of votes each classification of aspecific object received. But neither of these dominant approaches issatisfactory, and the two together are not satisfactory either, for thesearch and locate problem. It is not enough to divide and conquer,because in searching an image for a specific object considerableambiguity will be present, and if each image segment is only viewed by asingle person, there would be a high likelihood of missed targets (andindeed of false positives). If multiple participants are shown the sameimage and a vote is taken to decide if a target of interest is present,the outcome is better. But even in this case there are problems.Consider again the refugee problem—if there are in fact ten tents in agiven field of view (image segment), various participants might reportanywhere from three to twelve tents in the segment. A simple average ofthese counts could be taken, but would likely be inaccurate. But the“search and locate” problem also requires that the location of each tentbe identified (at least implicitly—it is not so important in thisparticular problem that the exact location of each tent is known, but itis important to use locations to resolve count ambiguities; in mostsearch and locate problems, though, the location aspect is a keyoutput).

What is needed in the art is a platform for the search and locate classof problems, that accurately translates a large amount of crowdsourcedinputs into an estimate of the precise locations of a number of targetsof interest.

SUMMARY OF THE INVENTION

The inventor has developed a platform for crowdsourcing the analysis ofimages, and particularly for analysis of aerial or satellite images togeolocate one or more targets of interest, or to identify objects ortheir types.

According to a preferred embodiment of the invention, a system forlarge-scale crowd sourcing of map data cleanup and correction,comprising an application server comprising a plurality of programminginstructions stored in a memory operating on a network-connectedcomputing device and adapted to receive at least a plurality of inputfrom a plurality of user devices, generate image data based at least inpart on map data received from a map data server, send at least aportion of image data to a user device based at least in part on thegenerated image data, receive input from the user device comprising atleast a plurality of tagging data provided by the device user, andprovide at least a plurality of tags to a crowdsourced search and locateserver, the tags being based at least in part on received tagging datafrom at least a user device; a crowdsourced search and locate servercomprising a plurality of programming instructions stored in a memoryoperating on a network-connected computing device and adapted to receiveat least a plurality of tags from an application server, computeagreement and disagreement values for at least a portion of theplurality of tags, perform at least an expectation-maximization analysisprocess based at least in part on the computed values; and a map dataserver comprising a plurality of programming instructions stored in amemory operating on a network-connected computing device and adapted tostore and provide map data, is disclosed.

According to another preferred embodiment of the invention, a method forestimating location and quality of a set of geolocation data, comprisingthe steps of receiving, at a crowdsourced search and locate server, aplurality of tags; computing agreement and disagreement values for atleast a portion of the tags; computing maximum likelihood values for atleast a portion of the tags, the likelihood values being based at leastin part on the computed agreements and disagreement values; merging aplurality of vectors based at least in part on the computed likelihoodvalues; and producing final tag and vector values based at least in parton the results of analysis performed in previous steps, is disclosed.

BRIEF DESCRIPTION OF THE DRAWING FIGURES

The accompanying drawings illustrate several embodiments of theinvention and, together with the description, serve to explain theprinciples of the invention according to the embodiments. One skilled inthe art will recognize that the particular embodiments illustrated inthe drawings are merely exemplary, and are not intended to limit thescope of the present invention.

FIG. 1 is a block diagram illustrating an exemplary hardwarearchitecture of a computing device used in various embodiments of theinvention.

FIG. 2 is a block diagram illustrating an exemplary logical architecturefor a client device, according to various embodiments of the invention.

FIG. 3 is a block diagram illustrating an exemplary architecturalarrangement of clients, servers, and external services, according tovarious embodiments of the invention.

FIG. 4 is a diagram of an exemplary architecture for a platform forcrowdsourced image analysis, according to a preferred embodiment of theinvention.

FIG. 5 is a process flow diagram of a method to allow a plurality ofusers to participate in crowdsourced image analysis, according to apreferred embodiment of the invention.

FIG. 6 is a process flow diagram of a method for estimating location andquality of a set of geolocation data based on tag data provided by aplurality of users of a crowdsourced image analysis platform of theinvention.

FIG. 7 is a process flow diagram of a method to accurately geolocate aplurality of targets using a crowdsourced image analysis platform of theinvention.

FIG. 8 is another block diagram illustrating an exemplary hardwarearchitecture of a computing device used in various embodiments of theinvention.

FIG. 9 is a high-level process flow diagram of a method to enhance mapdata derived from images using a crowdsourced image analysis platform ofthe invention

FIG. 10 is a data flow process diagram showing the more detailed use ofa crowd members ranking system (CMRS) and a vector extraction andverification system (VEVS) in the overall system and method forcrowdsourcing map data extraction and improvement from images.

FIG. 11 is a data flow process diagram showing the more detailed use ofa signature analysis system (SAS) in a crowdsourced image analysisplatform of the invention.

FIG. 12 is a data flow process diagram showing the use of crowdsourceparticipants with high reliability scores to continue the process ofdata editing and corrections in selected prioritized regions.

FIG. 13 is a process diagram showing the use of crowdsource participantswith high reliability scores to refine map data

DETAILED DESCRIPTION

One or more different inventions may be described in the presentapplication. Further, for one or more of the inventions describedherein, numerous alternative embodiments may be described; it should beunderstood that these are presented for illustrative purposes only. Thedescribed embodiments are not intended to be limiting in any sense. Oneor more of the inventions may be widely applicable to numerousembodiments, as is readily apparent from the disclosure. In general,embodiments are described in sufficient detail to enable those skilledin the art to practice one or more of the inventions, and it is to beunderstood that other embodiments may be utilized and that structural,logical, software, electrical and other changes may be made withoutdeparting from the scope of the particular inventions. Accordingly,those skilled in the art will recognize that one or more of theinventions may be practiced with various modifications and alterations.Particular features of one or more of the inventions may be describedwith reference to one or more particular embodiments or figures thatform a part of the present disclosure, and in which are shown, by way ofillustration, specific embodiments of one or more of the inventions. Itshould be understood, however, that such features are not limited tousage in the one or more particular embodiments or figures withreference to which they are described. The present disclosure is neithera literal description of all embodiments of one or more of theinventions nor a listing of features of one or more of the inventionsthat must be present in all embodiments.

Headings of sections provided in this patent application and the titleof this patent application are for convenience only, and are not to betaken as limiting the disclosure in any way.

Devices that are in communication with each other need not be incontinuous communication with each other, unless expressly specifiedotherwise. In addition, devices that are in communication with eachother may communicate directly or indirectly through one or moreintermediaries, logical or physical.

A description of an embodiment with several components in communicationwith each other does not imply that all such components are required. Tothe contrary, a variety of optional components may be described toillustrate a wide variety of possible embodiments of one or more of theinventions and in order to more fully illustrate one or more aspects ofthe inventions. Similarly, although process steps, method steps,algorithms or the like may be described in a sequential order, suchprocesses, methods and algorithms may generally be configured to work inalternate orders, unless specifically stated to the contrary. In otherwords, any sequence or order of steps that may be described in thispatent application does not, in and of itself, indicate a requirementthat the steps be performed in that order. The steps of describedprocesses may be performed in any order practical. Further, some stepsmay be performed simultaneously despite being described or implied asoccurring non-simultaneously (e.g., because one step is described afterthe other step). Moreover, the illustration of a process by itsdepiction in a drawing does not imply that the illustrated process isexclusive of other variations and modifications thereto, does not implythat the illustrated process or any of its steps are necessary to one ormore of the invention(s), and does not imply that the illustratedprocess is preferred. Also, steps are generally described once perembodiment, but this does not mean they must occur once, or that theymay only occur once each time a process, method, or algorithm is carriedout or executed. Some steps may be omitted in some embodiments or someoccurrences, or some steps may be executed more than once in a givenembodiment or occurrence.

When a single device or article is described, it will be readilyapparent that more than one device or article may be used in place of asingle device or article. Similarly, where more than one device orarticle is described, it will be readily apparent that a single deviceor article may be used in place of the more than one device or article.

The functionality or the features of a device may be alternativelyembodied by one or more other devices that are not explicitly describedas having such functionality or features. Thus, other embodiments of oneor more of the inventions need not include the device itself.

Techniques and mechanisms described or referenced herein will sometimesbe described in singular form for clarity. However, it should be notedthat particular embodiments include multiple iterations of a techniqueor multiple instantiations of a mechanism unless noted otherwise.Process descriptions or blocks in figures should be understood asrepresenting modules, segments, or portions of code which include one ormore executable instructions for implementing specific logical functionsor steps in the process. Alternate implementations are included withinthe scope of embodiments of the present invention in which, for example,functions may be executed out of order from that shown or discussed,including substantially concurrently or in reverse order, depending onthe functionality involved, as would be understood by those havingordinary skill in the art.

Definitions

A “database” or “data storage subsystem” (these terms may be consideredsubstantially synonymous), as used herein, is a system adapted for thelong-term storage, indexing, and retrieval of data, the retrievaltypically being via some sort of querying interface or language.“Database” may be used to refer to relational database managementsystems known in the art, but should not be considered to be limited tosuch systems. Many alternative database or data storage systemtechnologies have been, and indeed are being, introduced in the art,including but not limited to distributed non-relational data storagesystems such as Hadoop, column-oriented databases, in-memory databases,and the like. While various embodiments may preferentially employ one oranother of the various data storage subsystems available in the art (oravailable in the future), the invention should not be construed to be solimited, as any data storage architecture may be used according to theembodiments. Similarly, while in some cases one or more particular datastorage needs are described as being satisfied by separate components(for example, an expanded private capital markets database and aconfiguration database), these descriptions refer to functional uses ofdata storage systems and do not refer to their physical architecture.For instance, any group of data storage systems of databases referred toherein may be included together in a single database management systemoperating on a single machine, or they may be included in a singledatabase management system operating on a cluster of machines as isknown in the art. Similarly, any single database (such as an expandedprivate capital markets database) may be implemented on a singlemachine, on a set of machines using clustering technology, on severalmachines connected by one or more messaging systems known in the art, orin a master/slave arrangement common in the art. These examples shouldmake clear that no particular architectural approaches to databasemanagement is preferred according to the invention, and choice of datastorage technology is at the discretion of each implementer, withoutdeparting from the scope of the invention as claimed.

Similarly, preferred embodiments of the invention are described in termsof a web-based implementation, including components such as web serversand web application servers. However, such components are merelyexemplary of a means for providing services over a large-scale publicdata network such as the Internet, and other implementation choices maybe made without departing from the scope of the invention. For instance,while embodiments described herein deliver their services using webservices accessed via one or more webs servers that in turn interactwith one or more applications hosted on application servers, otherapproaches such as peer-to-peer networking, direct client-serverintegration using the Internet as a communication means between clientsand servers, or use of mobile applications interacting over a mobiledata network with a one or more dedicated servers are all possiblewithin the scope of the invention. Accordingly, all references to webservices, web servers, application servers, and an Internet should betaken as exemplary rather than limiting, as the inventive concept is nottied to these particular implementation choices.

As used herein, “crowdsourced” refers to the use of large numbers ofparticipants, each working independently of the others over theInternet, to accomplish a complex or large (or both) task provided by arequesting entity. Generally, the task is divided into many subtasks,each of which can be completed satisfactorily by a human withoutreference to any other information beyond what is provided with thesubtask. These subtasks are distributed by a “crowdsourcing platform” tomany different participants, some of whom receive more or less subtaskvolume based on quality, cost, willingness, or other parameters. In somecases, participants “pull” subtasks from an inventory of pendingsubtasks. Furthermore, in some embodiments subtasks may be generated “onthe fly” by users, for example by a user's spontaneously requesting thatan object be identified. Some subtasks may be submitted to more than oneparticipant, while others may be provided only to one participant. Aseach participant completes the subtasks assigned (or pulled), theresulting work is aggregated by the platform and a completed set ofresults for the overall task is provided to the original requestingentity.

As used herein, “crowdsourcing campaign” refers to a specific instanceof a crowdsourcing application used to solve a specific problem. Forinstance, a crowdsourced image analysis platform of the inventionfacilitates image analysis by many users; a crowdsourcing campaignorganizes such activities (and such users) for a specific image analysisproblem. For example, a crowdsourcing campaign might be set up andoperated whose goal is to find a downed airplane. Generally thecrowdsourcing platform will be configured generally for a plurality ofcampaigns, but a specific campaign will have its own configuration; inthe example given, the campaign's configuration would include theexpected region of interest and imagery associated with it, particulardetails about how to distribute image analysis tasks in the campaign,what criteria will be used to identify to a requesting entity when atarget of interest is identified and what confidence level exists forthe identification, and so forth.

As used herein, “search and locate” refers to a general class ofproblems wherein a set of images is searched for particular classes oftargets (such as buildings, tanks, railroad terminals, downed airplanes,etc.). It is common that the set of images may be searched to find morethan one class of targets (for example, to find all targets of militaryinterest), although single target class searches may also be performed(“find all cars”). Moreover, in some cases it may be known or presumed)in advance that only a single target of interest exists (a lost climbingparty, or a downed airplane), while in most cases the number of targetspresent in a given image set is unknown. The second part of the searchand locate problem is to precisely locate any resulting targets ofinterest (where is the down plane or lost party of climbers?).

As used herein, “image analysis” refers to the analysis of imagesobtained from one or more image sensors; generally, a single analysistask focuses on a set of images of a single region of interest on theearth. Satellite and aerial imagery are common examples of imagery thatare subjected to large scale image analysis. However, the inventiondescribed herein is not limited to common remote sensing image analysisproblems associated with satellite and aerial imagery. For example,analysis of large image sets from traffic cameras may be performed usingtechniques described herein.

As used herein, a “requesting entity” is a person or organization thatrequests a specific set of crowdsourced image analysis campaigns to becarried out via a crowdsourcing platform. That is, a crowdsourcingplatform may be operated by a single organization specialized in hostingsuch a platform, and be made available to a wide range of requestingentities (i.e., third parties) who may sign up for, manage, and pay theplatform operator to execute various crowdsourcing campaigns. Forexample, a government agency seeking to augment a search and rescueoperation may be a requesting entity, setting up an image analysiscampaign on a crowdsourcing platform.

As used herein, a “participating user” is a person, or a group ofpersons, that participates in a crowdsourcing campaign as a provider ofservice. Crowdsourcing relies on distributing tasks to a crowd; thatcrowd is comprised of participating users.

As used herein, “tags” are data points created by a participating user's“tagging” a specific point as corresponding to a specific target type.For instance, a participating user may place his cursor over a locationon an image that was presented to him, and select “tank” in order togenerate a tag that states that a tank is present in that image at thatlocation. In some embodiments, users may “tag” objects or regions by,for example, drawing polygons or other shapes surrounding them, usingone or more drawing tools provided by a user interface according to theinvention.

Hardware Architecture

Generally, the techniques disclosed herein may be implemented onhardware or a combination of software and hardware. For example, theymay be implemented in an operating system kernel, in a separate userprocess, in a library package bound into network applications, on aspecially constructed machine, on an application-specific integratedcircuit (ASIC), or on a network interface card.

Software/hardware hybrid implementations of at least some of theembodiments disclosed herein may be implemented on a programmablenetwork-resident machine (which should be understood to includeintermittently connected network-aware machines) selectively activatedor reconfigured by a computer program stored in memory. Such networkdevices may have multiple network interfaces that may be configured ordesigned to utilize different types of network communication protocols.A general architecture for some of these machines may be disclosedherein in order to illustrate one or more exemplary means by which agiven unit of functionality may be implemented. According to specificembodiments, at least some of the features or functionalities of thevarious embodiments disclosed herein may be implemented on one or moregeneral-purpose computers associated with one or more networks, such asfor example an end-user computer system, a client computer, a networkserver or other server system, a mobile computing device (e.g., tabletcomputing device, mobile phone, smartphone, laptop, and the like), aconsumer electronic device, a music player, or any other suitableelectronic device, router, switch, or the like, or any combinationthereof. In at least some embodiments, at least some of the features orfunctionalities of the various embodiments disclosed herein may beimplemented in one or more virtualized computing environments (e.g.,network computing clouds, virtual machines hosted on one or morephysical computing machines, or the like).

Referring now to FIG. 1, there is shown a block diagram depicting anexemplary computing device 100 suitable for implementing at least aportion of the features or functionalities disclosed herein. Computingdevice 100 may be, for example, any one of the computing machines listedin the previous paragraph, or indeed any other electronic device capableof executing software- or hardware-based instructions according to oneor more programs stored in memory. Computing device 100 may be adaptedto communicate with a plurality of other computing devices, such asclients or servers, over communications networks such as a wide areanetwork a metropolitan area network, a local area network, a wirelessnetwork, the Internet, or any other network, using known protocols forsuch communication, whether wireless or wired.

In one embodiment, computing device 100 includes one or more centralprocessing units (CPU) 102, one or more interfaces 110, and one or morebusses 106 (such as a peripheral component interconnect (PCI) bus). Whenacting under the control of appropriate software or firmware, CPU 102may be responsible for implementing specific functions associated withthe functions of a specifically configured computing device or machine.For example, in at least one embodiment, a computing device 100 may beconfigured or designed to function as a server system utilizing CPU 102,local memory 101 and/or remote memory 120, and interface(s) 110. In atleast one embodiment, CPU 102 may be caused to perform one or more ofthe different types of functions and/or operations under the control ofsoftware modules or components, which for example, may include anoperating system and any appropriate applications software, drivers, andthe like.

CPU 102 may include one or more processors 103 such as, for example, aprocessor from one of the Intel, ARM, Qualcomm, and AMD families ofmicroprocessors. In some embodiments, processors 103 may includespecially designed hardware such as application-specific integratedcircuits (ASICs), electrically erasable programmable read-only memories(EEPROMs), field-programmable gate arrays (FPGAs), and so forth, forcontrolling operations of computing device 100. In a specificembodiment, a local memory 101 (such as non-volatile random accessmemory (RAM) and/or read-only memory (ROM), including for example one ormore levels of cached memory) may also form part of CPU 102. However,there are many different ways in which memory may be coupled to system100. Memory 101 may be used for a variety of purposes such as, forexample, caching and/or storing data, programming instructions, and thelike.

As used herein, the term “processor” is not limited merely to thoseintegrated circuits referred to in the art as a processor, a mobileprocessor, or a microprocessor, but broadly refers to a microcontroller,a microcomputer, a programmable logic controller, anapplication-specific integrated circuit, and any other programmablecircuit.

In one embodiment, interfaces 110 are provided as network interfacecards (NICs). Generally, NICs control the sending and receiving of datapackets over a computer network; other types of interfaces 110 may forexample support other peripherals used with computing device 100. Amongthe interfaces that may be provided are Ethernet interfaces, frame relayinterfaces, cable interfaces, DSL interfaces, token ring interfaces,graphics interfaces, and the like. In addition, various types ofinterfaces may be provided such as, for example, universal serial bus(USB), Serial, Ethernet, Firewire, PCI, parallel, radio frequency (RF),Bluetooth, near-field communications (e.g., using near-field magnetics),802.11 (WiFi), frame relay, TCP/IP, ISDN, fast Ethernet interfaces,Gigabit Ethernet interfaces, asynchronous transfer mode (ATM)interfaces, high-speed serial interface (HSSI) interfaces, Point of Sale(POS) interfaces, fiber data distributed interfaces (FDDIs), and thelike. Generally, such interfaces 110 may include ports appropriate forcommunication with appropriate media. In some cases, they may alsoinclude an independent processor and, in some instances, volatile and/ornon-volatile memory (e.g., RAM).

Although the system shown in FIG. 1 illustrates one specificarchitecture for a computing device 100 for implementing one or more ofthe inventions described herein, it is by no means the only devicearchitecture on which at least a portion of the features and techniquesdescribed herein may be implemented. For example, architectures havingone or any number of processors 103 may be used, and such processors 103may be present in a single device or distributed among any number ofdevices. In one embodiment, a single processor 103 handlescommunications as well as routing computations, while in otherembodiments a separate dedicated communications processor may beprovided. In various embodiments, different types of features orfunctionalities may be implemented in a system according to theinvention that includes a client device (such as a tablet device orsmartphone running client software) and server systems (such as a serversystem described in more detail below).

Regardless of network device configuration, the system of the presentinvention may employ one or more memories or memory modules (such as,for example, remote memory block 120 and local memory 101) configured tostore data, program instructions for the general-purpose networkoperations, or other information relating to the functionality of theembodiments described herein (or any combinations of the above). Programinstructions may control execution of or comprise an operating systemand/or one or more applications, for example. Memory 120 or memories101, 120 may also be configured to store data structures, configurationdata, encryption data, historical system operations information, or anyother specific or generic non-program information described herein.

Because such information and program instructions may be employed toimplement one or more systems or methods described herein, at least somenetwork device embodiments may include nontransitory machine-readablestorage media, which, for example, may be configured or designed tostore program instructions, state information, and the like forperforming various operations described herein. Examples of suchnontransitory machine-readable storage media include, but are notlimited to, magnetic media such as hard disks, floppy disks, andmagnetic tape; optical media such as CD-ROM disks; magneto-optical mediasuch as optical disks, and hardware devices that are speciallyconfigured to store and perform program instructions, such as read-onlymemory devices (ROM), flash memory, solid state drives, memristormemory, random access memory (RAM), and the like. Examples of programinstructions include both object code, such as may be produced by acompiler, machine code, such as may be produced by an assembler or alinker, byte code, such as may be generated by for example a Javacompiler and may be executed using a Java virtual machine or equivalent,or files containing higher level code that may be executed by thecomputer using an interpreter (for example, scripts written in Python,Perl, Ruby, Groovy, or any other scripting language).

In some embodiments, systems according to the present invention may beimplemented on a standalone computing system. Referring now to FIG. 2,there is shown a block diagram depicting a typical exemplaryarchitecture of one or more embodiments or components thereof on astandalone computing system. Computing device 200 includes processors210 that may run software that carry out one or more functions orapplications of embodiments of the invention, such as for example aclient application 230. Processors 210 may carry out computinginstructions under control of an operating system 220 such as, forexample, a version of Microsoft's Windows operating system, Apple's MacOS/X or iOS operating systems, some variety of the Linux operatingsystem, Google's Android operating system, or the like. In many cases,one or more shared services 225 may be operable in system 200, and maybe useful for providing common services to client applications 230.Services 225 may for example be Windows services, user-space commonservices in a Linux environment, or any other type of common servicearchitecture used with operating system 210. Input devices 270 may be ofany type suitable for receiving user input, including for example akeyboard, touchscreen, microphone (for example, for voice input), mouse,touchpad, trackball, or any combination thereof. Output devices 260 maybe of any type suitable for providing output to one or more users,whether remote or local to system 200, and may include for example oneor more screens for visual output, speakers, printers, or anycombination thereof. Memory 240 may be random-access memory having anystructure and architecture known in the art, for use by processors 210,for example to run software. Storage devices 250 may be any magnetic,optical, mechanical, memristor, or electrical storage device for storageof data in digital form. Examples of storage devices 250 include flashmemory, magnetic hard drive, CD-ROM, and/or the like.

In some embodiments, systems of the present invention may be implementedon a distributed computing network, such as one having any number ofclients and/or servers. Referring now to FIG. 3, there is shown a blockdiagram depicting an exemplary architecture for implementing at least aportion of a system according to an embodiment of the invention on adistributed computing network. According to the embodiment, any numberof clients 330 may be provided. Each client 330 may run software forimplementing client-side portions of the present invention; clients maycomprise a system 200 such as that illustrated in FIG. 2. In addition,any number of servers 320 may be provided for handling requests receivedfrom one or more clients 330. Clients 330 and servers 320 maycommunicate with one another via one or more electronic networks 310,which may be in various embodiments of the Internet, a wide areanetwork, a mobile telephony network, a wireless network (such as WiFi,Wimax, and so forth), or a local area network (or indeed any networktopology known in the art; the invention does not prefer any one networktopology over any other). Networks 310 may be implemented using anyknown network protocols, including for example wired and/or wirelessprotocols.

In addition, in some embodiments, servers 320 may call external services370 when needed to obtain additional information, or to refer toadditional data concerning a particular call. Communications withexternal services 370 may take place, for example, via one or morenetworks 310. In various embodiments, external services 370 may compriseweb-enabled services or functionality related to or installed on thehardware device itself. For example, in an embodiment where clientapplications 230 are implemented on a smartphone or other electronicdevice, client applications 230 may obtain information stored in aserver system 320 in the cloud or on an external service 370 deployed onone or more of a particular enterprise's or user's premises.

In some embodiments of the invention, clients 330 or servers 320 (orboth) may make use of one or more specialized services or appliancesthat may be deployed locally or remotely across one or more networks310. For example, one or more databases 340 may be used or referred toby one or more embodiments of the invention. It should be understood byone having ordinary skill in the art that databases 340 may be arrangedin a wide variety of architectures and using a wide variety of dataaccess and manipulation means. For example, in various embodiments oneor more databases 340 may comprise a relational database system using astructured query language (SQL), while others may comprise analternative data storage technology such as those referred to in the artas “NoSQL” (for example, Hadoop, MapReduce, BigTable, and so forth). Insome embodiments variant database architectures such as column-orienteddatabases, in-memory databases, clustered databases, distributeddatabases, key-value stores, or even flat file data repositories may beused according to the invention. It will be appreciated by one havingordinary skill in the art that any combination of known or futuredatabase technologies may be used as appropriate, unless a specificdatabase technology or a specific arrangement of components is specifiedfor a particular embodiment herein. Moreover, it should be appreciatedthat the term “database” as used herein may refer to a physical databasemachine, a cluster of machines acting as a single database system, or alogical database within an overall database management system. Unless aspecific meaning is specified for a given use of the term “database”, itshould be construed to mean any of these senses of the word, all ofwhich are understood as a plain meaning of the term “database” by thosehaving ordinary skill in the art.

Similarly, most embodiments of the invention may make use of one or moresecurity systems 360 and configuration systems 350. Security andconfiguration management are common information technology (IT) and webfunctions, and some amount of each are generally associated with any ITor web systems. It should be understood by one having ordinary skill inthe art that any configuration or security subsystems known in the artnow or in the future may be used in conjunction with embodiments of theinvention without limitation, unless a specific security 360 orconfiguration 350 system or approach is specifically required by thedescription of any specific embodiment.

In various embodiments, functionality for implementing systems ormethods of the present invention may be distributed among any number ofclient and/or server components. For example, various software modulesmay be implemented for performing various functions in connection withthe present invention, and such modules can be variously implemented torun on server and/or client components.

FIG. 8 shows an exemplary overview of a computer system 800 as may beused in any of the various locations throughout the system. It isexemplary of any computer that may execute code to process data. Variousmodifications and changes may be made to computer system 800 withoutdeparting from the broader spirit and scope of the system and methoddisclosed herein. CPU 801 is connected to bus 802, to which bus is alsoconnected memory 803, nonvolatile memory 804, display 807, I/O unit 808,and network interface card (NIC) 813. I/O unit 808 may, typically, beconnected to keyboard 809, pointing device 810, hard disk 812, andreal-time clock 811. NIC 813 connects to network 814, which may be theInternet or a local network, which local network may or may not haveconnections to the Internet. Also shown as part of system 800 is powersupply unit 805 connected, in this example, to ac supply 806. Not shownare batteries that could be present, and many other devices andmodifications that are well known but are not applicable to the specificnovel functions of the current system and method disclosed herein.

Description of System Architecture

FIG. 4 is a diagram of an exemplary architecture for a platform 400 forcrowdsourced image analysis, according to a preferred embodiment of theinvention. According to the embodiment, crowdsourcing is accomplished bydistributing image analysis tasks to various participant users, whotypically access platform 400 via Internet 401 from tablet devices 415,laptops 413, personal computers 410 with monitors 411, or otherInternet-accessible computing devices. Access to platform 400 istypically, although not necessarily, made using a browser 412, 414, 416(or a similar Internet-connected software application). As is typical ofWeb applications, platform 400 may be accessed by participating usersvia web server 430, which may comprise web server software such asMicrosoft Internet Information Server, Apache Web Server, IBM WebsphereWeb Server, or any other web server known in the art, stored andoperating on a single network-attached server computer or a cluster ofserver computers, or it may comprise such software operating on aplurality of such machines, and may be placed behind a load balancer(not shown) that distributes requests among the various instances of webserver 430. As is typical of Web applications, participant user requestspass from browsers 412, 414, 416 via Internet 401 to web server 430,which stores and returns static web page elements locally, and passesapplication-specific requests to application server 431. Applicationserver 431 may be any particular form of application server known in theart, such as Apache Tomcat or Geronimo, Java Platform EnterpriseEdition, RedHat JBoss AS, Windows Server, or IBM WebSphere ApplicationServer; further, it will be understood by one having ordinary skill inthe art that this list is merely exemplary and is in no way limiting.Application server 431 may comprise application server software storedand operating on a single network-attached server computer, or it maycomprise such software operating on a plurality of such machines, andmay be placed behind a load balancer (not shown) that distributesrequests among the various instances of application server 431. As iscommon in the art, application server 431 uses a database 432 to storeapplication-specific data. Typically (although not necessarily),application server 431 will offer a stateless representation statetransfer (REST) application programming interface (API) to users via webserver 430, and accordingly all application state data is maintained indatabase 432, which facilitates scalable operations (since eachapplication server 431 instance is not required to maintain stateinformation separately, and since the need for complex state propagationbetween application servers is thereby eliminated. Of course, it will beappreciated by one having ordinary skill in the art that the generalarchitecture of a web server 430 coupled to an application server 431via a REST API, with database 432 storage of application data, istypical of scalable web applications but is also merely exemplary. Itmay be desirable in some cases for a client-server connection betweendedicated applications 412, 414, 416 and a dedicated server software 431that uses a proprietary interface and could even be a stateful serverapplication.

With this basic architecture in mind regarding the connections betweenparticipating users and application server 432, specific aspects of theinvention will now be described. Before participating users canparticipate in a crowdsourcing campaign, a requesting entity must set upthe campaign. Requesting entity (and administrative) users interact withapplication server 431 via the Internet 401 and web server 430 just asparticipating users do; a single PC 420 with monitor 421 and browser 422is shown in FIG. 4 to represent administrative and requesting entityusers (it should be noted of course that only PC 420 is shown forbrevity; as with participating users, administrative/requesting entityusers may use any suitable Internet-capable computing device accordingto the invention). Requesting entity users will generally create andmanage crowdsourced image analysis campaigns, and will view results ofsuch campaigns (possibly adjusting the settings of such campaigns as aresult of such reviews, to improve the performance of such campaigns).Once a campaign is set up, it may be activated by the requesting entity,at which point participating users may “join” the campaign and thereuponstart receiving image analysis tasks associated with the campaign toperform. In a preferred embodiment, images are delivered form database432 to participating users by application server 431 via web server 430,and participating users interact with such images in web browsers 412,414, 416 using tools provided by application server 432. In someembodiments, however, third party crowdsourcing platforms such asAmazon's Mechanical Turk 450 may be used to manage a crowdsourced imageanalysis campaign using images and requirements provided by applicationserver 431 or directly from database 432.

As noted above in the background section, one common challenge in searchand locate problems, which is not addressed by current crowdsourcingtechniques (which, as noted, use either or both of the work distributionwith quality measurement and the democratic/voting techniques), is theproblem of accurately finding and locating targets of interest usingcrowdsourcing. The shortcomings of the two main crowdsourcing approaches(work distribution and voting) are different for each approach. The workdistribution approach is still useful in search and locate problems, butit is not adequate by itself, as it does not provide a means forlocating targets of interest, particularly when many participating users“tag” the same target of interest, often with varying locations(generally nearby, but in some cases even quite distant from eachother). The voting approach, while excellent for ranking reputations (isthis a good song or not?) or for classification problems (is this a tankor not?), does not handle continuous variations of input data well. Thatis, voting is good when there is a small set of possible options (whichis this: a dog, a cat, or a skunk?); the resulting tallies for eachdiscrete element of the set can be compared and a “winner” selected(it's a cat). But when the input provided by participating users is notonly the presence of an object but also its two-dimensional location (oreven three-dimensional location), the simple voting approach does nothelp to answer the question, “where is it, really?”

Accordingly, in a preferred embodiment platform 400 further comprises acrowdsourced search and locate service 440, which may be stored andoperating on a single network-attached server coupled to applicationserver 431. In some embodiments, crowdsourced search and locate service440 operates on a large number of independent machines whose activitiesmay be coordinated using an approach such as the well-known map/reducetechnique. Crowdsourced search and locate service 440 takes as inputs a(typically large) set of tags from many participating users.Fundamentally, crowdsourced search and locate service 440 implements acrowdsourced search and locate service algorithm (described in detailbelow) that attempts to determine a “most likely” set of targets thatare present in an image, using a large amount of tagging data obtainedfrom participating users viewing the same or related images. Becauselocation tagging is an inherently noisy process (people vary widely, ata minimum; in addition, some viewers may view an image at higherresolution than others, while some may tag an extensive object at itscentroid while others tag it at various points on its edges, and soforth). Therefore, it will usually be the case that tag data input tothe crowdsourced search and locate service 440 is very noisy; forexample, if there are several targets of interest close to each other“in the real world” (i.e., in the place from which the image was taken,at the time the image was taken), the inevitable inaccuracies in users'tagging may result in (for example) a single cloud of nearby tags thatmight be interpreted as belonging to a single target of large extent butactually belongs to two or more “real” targets. The crowdsourced searchand locate algorithm may optionally take as input one or more sets ofprior data, for instance regarding the quality of a specific set ofparticipating users' previous tagging work; such prior data may (asdescribed below) be used to improve the time to convergence of thealgorithm. In some embodiments, prior data may also be used to improveaccuracy of the algorithm, instead of (or in addition to) improving itsconvergence time. For example, if a known-malicious user is given aprior that says he is a poor tagger, his input will be ignored insteadof calculated into the mix. In some cases, the algorithm might notarrive at the conclusion that a particular user is malicious, but if hisprior data suggests so, it may be more likely to be detectable by thealgorithm. Given these inputs, the crowdsourced search and locatealgorithm uses an iterative expectation-maximization process togenerate, as outputs, three sets of data (although conventionallymaximization processes are used after an expectation of maximumlikelihood, it should be noted that, where convenient, the algorithm canbe conducted using a numerical minimization approach by simply mappingvariables in a corresponding way). The first is an array of qualityscores for the taggers (the participating users who created tags as partof the crowdsourcing campaign whose data is being analyzed by thecrowdsourced search and locate algorithm). The second is an array ofdifficulty scores for each tagged target. The third is an array ofestimated locations of actual targets, comprising for each target datasuch as the latitude and longitude of the target, the type of the target(tank, railroad car, damaged building, debris field, etc.), and aconfidence level in the identification.

Fundamentally, the crowdsourced search and locate algorithm is focusedon identifying an underlying hidden variable (the real targets thatexisted at a time of interest) using incomplete data (the tagging data,which won't necessarily have tags for all of the real targets, and whichmay have many tags for each real target). In order to move from theinputs (principally tag data, each tag comprising a tag identifier, atagger identifier, a location (latitude and longitude, or a UTM gridpoint and easting and northing values for the offset from that UTM gridpoint), the crowdsourced search and locate algorithm carries out a keydata transformation, then uses a modified iterativeexpectation-maximization (EM) algorithm to generate a set ofintermediate outputs, then performs a clustering on the interim outputsto arrive at the final crowdsourced search and locate output. Thedetails will be described below, but at a high level the initial datatransformation involves converting straightforward geolocationinformation (a series of tags generated by participating users) into aset of agreement/disagreement data (meaning agreement or disagreementamong the participating users of the input set). Also, since EMalgorithms known in the art take an input vector and a parameter vectorand attempt to identify a vector corresponding to a hidden variable ofwhich the input vector represents a (possibly noisy) subset, in thecrowdsourced search and locate algorithm the vector of quality scoresand the vector of difficulty scores are mathematically combined andtreated as the parameter vector for EM algorithm purposes.

From a use case perspective, what is accomplished using platform 400includes: setting up (by requesting entities) image analysis campaigns;running the campaigns to generate tag sets from participating users;displaying the results to one or more requesting entity users; and usingthe crowdsourced search and locate algorithm with the results as inputto generate an estimate of ground truth (that is, an estimate of theactual targets of interest and their locations) and displaying ordisseminating the same to the requesting entity users (for example, byauto-generating kml/kmz files, and making the resulting output availablevia a REST API for consumption by users' workflows).

Description of Method Embodiments

FIG. 5 is a process flow diagram of a method 500 to allow a plurality ofusers to participate in crowdsourced image analysis, according to apreferred embodiment of the invention. According to the embodiment, instep 501 a participating user may register with platform 400 (therebyobtaining a user identifier), and once registered, may log in toplatform 400 in order to participate in one or more crowdsourced imageanalysis campaigns. It will be appreciated by one having ordinary skillin the art that there is a variety of information that may be obtainedby platform 400 during user registration, such as user name, userbackground, type of user (volunteer, paid, etc.), organizationalmembership, tagger group memberships, and the like. For example, a newuser may register as a member of an organization that is focused on aparticular campaign, set of campaigns, or type of campaigns (forexample, a “league of armchair military analysts”, whose members focusonly on military analysis, such as tracking developments in combat areassuch as Syria or Mali); alternatively or also, a user may register as amember of one or more existing “tagger groups” (such as search andrescue, climate change damage assessment, and so forth). In someembodiments, “passive login”, such as logging in using Facebook™ orMechanical Turk™ credentials, may be provided; for example, a user maybe logged in automatically with an identifier corresponding to hisMechanical Turk™ or Facebook™ identifier, and the user would thereforenot see a login process occurring. Once a participating user has loggedin, he may be presented with a list of active campaigns for which he iseligible (campaigns may be unrestricted, meaning every registered useris eligible to participate, or they may be limited to participatingusers from specific organizations or tagger groups, or to participatingusers who satisfy some criterion such as experience level, averagequality rating, Mechanical Turk™ qualification, etc.). Upon viewing sucha list of available campaigns, in step 502 the user may select acampaign in which he wishes to participate; alternatively, in step 502platform 400 may automatically assign the user to a specific campaignupon login. In support of the selection process of step 502 (whenperformed manually by a participating user), the user may be shown alist (using any of the many well-established user interface conventionsfor displaying lists from which selections are to be made) of availablecampaigns that the specific user may participate in. In someembodiments, some campaigns may be limited to certain classes or groupsof participating users; for example, a sensitive law enforcementcampaign may only be made available/visible to qualified law enforcementpersonnel (this may actually occur, for example, when a high-profilesearch for a target is needed, and law enforcement personnel from a widevariety of agencies may desire to assist informally, without sensitiveinformation being divulged to the public at large). In some embodiments,campaigns may be assigned automatically by platform 400 in step 502, forinstance where new participating users are assigned to a specifictraining campaign until they complete the required training or otherwisedemonstrate proficiency.

Once a campaign has been selected by or for a participating user, instep 503 the user may navigate to a specific map section to carry outtagging operations (that is, to attempt to identify and locate targetsof interest in the map section to which the user has navigated). Again,as in campaign selection, in some embodiments automated action may betaken in step 503, rather than allowing a user to manually select a mapsection for viewing. For example, it may be important that users are notprovided information about the actual map location (that is, gridcoordinates or latitude and longitude) of map sections as they view themand carry out tagging operations. In some cases, it may be importantthat users are unable to identify the actual, physical location of atarget of interest on the earth's surface (for instance, to preventlooting of valuable archaeological sites). Accordingly, users may be“navigated” automatically in step 503, by being shown successive mapsections without their spatial locations or relationships being known.In some embodiments, platform 400 may enforce a sampling regimen whereinvarious map segments are assigned probability levels (of having targetsof interest in them) or interest levels, and the number of participatingusers who are encouraged or made to view specific map sections may varyaccordingly (more users might be assigned to more interesting,promising, or difficult map sections). Similarly, in some embodimentsusers may be provided an option to manually navigate or to have thesystem navigate for them (for instance, they could be provided a “next”button, or a “surprise me” button, as well as a small map of an entireinteresting region via which they can manually navigate by selecting amap segment using for example a computer mouse or a touchpad). Once aparticipating user is “in” (i.e., viewing) a particular map segment, theuser tags all relevant objects (targets of interest) in that section instep 504 (of course, it should be apparent that not all users will findall actual targets in any given map segment; skill, persistence, andinterest level—among other variables—may cause some to tag only asubset, and others to tag false targets of interest, and so forth). Insome embodiments, in step 505 a participating user may view agreementdata while tagging objects. For example, when a user moves a graphicalcursor to a specific map location and selects an action (e.g., “tag astank”), a graphical indicia may be displayed advising the user how manyother users placed a similar tag there (or within a reasonable—andconfigurable—distance from the user's cursor location); in someembodiments, a second graphical indicia such, as a colored cursor, maybe provided to indicate a position of the centroid of a set of otherusers' tags, effectively indicating to the participating userinformation such as, “ten other people tagged a tank, but the grouplocates the tank at this slightly different location”. Accordingly,users may be provided a means to edit their tags (for example, byclicking and dragging their tag onto the marked centroid position, or toadjust its position relative to an underlying image feature, asdesired). When editing is completed in step 505, a user may simply moveon to make another tag, or may be provided with a positive confirmationmeans, such as a clickable “Tag” button, to indicate that a particulartag will no longer be edited, but a new tag may be placed in the currentmap segment. In some embodiments, some or all users may not be shownagreement data, for example to encourage “open minded” tagging bysuppressing feedback from other users' activities.

In step 508, once a participating user is finished tagging objects in aspecific map section (typically, because either the user is bored with aparticular map section, or the user believes she has tagged all targetsof interest), the user may navigate to another map section (again,manually or automatically), and resume carrying out method 500 in step504. In step 507, when a user is finished, either because the userdecides to complete their tagging session, or because a campaign settingis reached (for instance, a campaign might specify that no user shoulddo more than ten map sections at a time), then in step 509 the userexits method 500 (typically by navigating away from the web pageprovided by platform 400 for participating users).

FIG. 6 is a process flow diagram of a method 600 for estimating locationand quality of a set of geolocation data based on tag data provided by aplurality of users of a crowdsourced image analysis platform of theinvention. In a first step 601, a set L of tags made by participatingusers (using method 500) for a particular campaign is loaded as input tomethod 600. Typically, each tag will comprise a tag identifier, a taggeridentifier (each participating user is given a unique identifier, andall tags made by a specific participating user will have the same taggeridentifier), a location (either latitude and longitude, or UTM grid pluseasting and northing values, or another geospatial reference location),and a type of tag (for example, “tank”, “debris field”, “building”, andthe like). Of course, other data elements may be provided as well, suchas overlay identifiers (when multi-layer maps and tagging are used), butthe core elements of tag identifier, tagger identifier, tag type, andtag location will generally always be present. In step 602, each tag inL in turn has agreement and disagreement values computed. This is doneby taking a specific tag and then looping over all other tags in L. Thespecific tag may be given an agreement value of 1 (because it bydefinition agrees with itself; of course, values other than 1 may beused for agreement, according to the invention). For each other tag thatis considered with respect to the specific tag, a distance computationis made from the specific tag to the other tag. In a preferredembodiment, if the computed distance is less than a first specified(configurable) value (i.e., the other tag is “close” to the specifictag), then a new entry is added to L for the other tag, and an agreementvalue of 1 is assigned; if the distance is more than the first specifiedvalue but less than a second specified (also configurable) value (thesecond specific value always being greater than the first specificvalue), then the other tag is “sort of close” to the specific tag, and anew entry is added to L for the other tag, with an agreement value of 0(disagreement; as in the case of agreement, a value other than 0 can beused in some embodiments); finally, if the computed distance is greaterthan the second specific value, then the other tag is consideredunrelated to the specific tag, and no new element is added to L. Itshould be clear that, upon completion of step 602, a vector of tags Lthat initially had length Len(L) will now be much larger, having alength given by X*Len(L), where X is the average number of new entriesadded per tag (that is, the average number of tags that are either closeor sort of close to a given tag); furthermore, each element in L will,after step 602, have an agreement/disagreement value.

It should be noted that the method just described is one way ofassigning “agreement” and “disagreement” values; others are possibleaccording to the invention as well. For example, consider that theradius may represent a circular “kernel” with the tag of interest at itscenter. If another tag were inside the kernel, it could be considered toagree with the tag of interest. One can then extend the idea of a kernelto include any arbitrary shapes (and one can assign agreement valuesthat are between zero and one, for example depending on distance fromthe center). As an example of such an approach, when detecting roads orother straight-line type of features, the kernel could be a long skinnyellipse. The ellipse could be rotated through all possible angles; theangle for which the highest number of other nearby tags “agree” would bethe one that is chosen and then used to establish agreement anddisagreement values (which again may be binary or continuously-valued).Of course, other shapes could also be rotated; for example, an “X” shapecould be used to detect road intersections. Similarly, disagreement alsocan be assigned in many possible ways. The way described abovecorresponds to a disagreeing tag's falling inside of one kernel whilefalling outside of another. Or, a tagger who views an area of anotheruser's tag but does not “agree” automatically disagrees. In this case,it is not a tag “disagreeing” with another tag, but rather it is anotheruser disagreeing with a tag of interest. In some embodiments, it isdesirable to send users to a specific, discrete set of locations, inorder that it may be definitely established that two or more users sawexactly the same thing, in which case disagreement can be more readilyascertained (and with a higher degree of confidence).

Once L has been expanded as described in step 602, in step 603 initialvalues are assigned for arrays A, B, and Z. A is an array comprising oneelement for each unique tagger (participating user) who has provided atleast one tag to L. Each element of A may comprise a tagger identifier(the unique identifier for a specific participating user), a meanquality of tags made by the specific tagger, and a standard deviation ofthe quality of tags made by the specific tagger. “Quality” means, in apreferred embodiment, a value from −1 to 1, where −1 means the specifictag by a specific tagger is completely malicious (known to be false), 1means the specific tag by the specific tagger is completely trustworthy(known to be true), a value less than 0 but not equal to −1 means thetag is more likely than not to be malicious, and a value greater than 0but less than 1 means the tag is more likely than not to be reasonable(i.e., not malicious). A value of 0 indicates that a tag is inaccuratebut not malicious. Initial values of the elements in A may be eitherloaded from database 432 as priors, or may be instantiated (for eachtagger identifier) with default values (such as 0 mean, 0 standarddeviation). Similarly, quality values may be assigned based ondisagreement; for instance, a user may see a really obvious object totag and not tag it, either because he is inept or malicious. Eachelement of B may comprise a tag identifier (the unique identifier for aspecific tag), a mean difficulty of the tag as made by various taggers(that is, if many taggers identified a “tank” at a location, thedifficulty scores for each such tag are averaged), and a standarddeviation of the difficulty of the tag as made by various taggers.“Difficulty” means, in a preferred embodiment, a value from 0 to 1,where 0 means the specific tag is “very easy” (very likely to becorrectly tagged by a random tagger), and 1 means the specific tag is“very hard” (very unlikely to be correctly tagged by a random tagger).Initial values of the elements in B may be either loaded from database432 as priors, or may be instantiated (for each tag identifier) withdefault values (such as 0.5 mean, 0 standard deviation). Each element ofZ may comprise a tag identifier (the unique identifier for a specifictag), and a probability value, which represents the probability that thespecific tag is correct (meaning it correctly tags a real object).Initial values of the elements in Z may be either loaded from database432 as priors, or may be instantiated (for each tag identifier) withdefault values for the probabilities for each tag (such as 0.5). Recallthat L is a set of input obtained from users attempting to tag objectsin images; it is assumed that there is a hidden variable representingthe set of all actual targets of interest in the region covered by theimages, so the probabilities in Z represent the likelihood that a giventag represents an actual object in the specific geospatial locationassociated with the tag in question. The goal of method 600 is to obtainmaximized (at least locally) values of Z, given parameter sets A and B.Accordingly, in step 604 (the expectation step), an expectation of themaximum likelihood P that Z reflects the underlying hidden variable (theactual targets of interest in the image field), given the parametervectors A and B, is computed in the normal way using the current valuesof A and B. Then, in step 605, vectors A and B are merged into a singlevector AB (note that each element of A and of B has form {ID, Mean,StdDev}, so merging the two vectors—by concatenation—creates a singlevector comprising elements of the same form), in preparation forcarrying out the maximization step. Then, in step 606, the maximizationstep is carried out by estimating a new value AB_(n+1) based on AB_(n)by iteratively computing the argument of the maximum of Q(Z|AB_(n)) overall Z, where Q is computed in the normal way. Once this is done, thevector AB is unpacked into its components A and B in step 607, and instep 608 a test is made to determine whether either a configured maximumnumber of EM iterations has occurred (requiring termination to avoidpossible endless loops and to limit the time of operation of thecrowdsourced search and locate algorithm) or whether the change in AB isless than a configured minimum (meaning convergence has occurred); ifeither of these conditions is met, then method 600 moves to step 610 andthe final values of A, B, and Z are output by crowdsourced search andlocate service 440 to the user or application that originally requestedthe crowdsourced search and locate algorithm to be executed. If neitherof the conditions of step 608 is met, then in step 609 the new values ofA and B (taken from the unpacked AB_(n+1)) and Z (determined as part ofthe maximization step) are returned and execution resumes again at step604, for another iteration of the EM algorithm.

FIG. 7 is a process flow diagram of a method 700 to accurately geolocatea plurality of targets using a crowdsourced image analysis platform ofthe invention. Once the method 600 has been carried out, an array oftags and their probabilities (that is, Z) is available, but it is stillunclear what a set of real or actual targets of interest in the regioncovered by the images from which the tags were made is. For example,many of the tags in Z may be duplicates of other tags (for instance, ifseveral different taggers tag the same object), and the precise locationof each real object is yet to be determined. It should be evident thatsuch locations are likely to be closest to the corresponding tag thathas the highest probability value (recall that Z comprises tuples of{tag ID, probability}). Accordingly, a clustering method 700 is providedin various embodiments of the invention. Upon commencing method 700, instep 701 all of the points in Z are ordered (sorted) by tag quality(that is, by the probability of each tag's being correct). Then, in step702 a check is made to see if any tags remain in the list; if none do,execution passes to step 707 and the output of all selected tags isprinted or returned to a requesting entity. Otherwise, in step 703 thenext tag T (by definition, the highest remaining tag in order ofprobability/quality) is selected. In step 704, the quality score orprobability of tag T is checked to see if it is below a defined(configurable) threshold. If it is below the threshold, then executionjumps to step 707 and the output of all selected tags is printed orreturned to a requesting entity. If the quality score of tag T in step704 is above the threshold, then execution continues to step 705. Ineffect, step 704 and the threshold it uses together mean that all tagswhose quality is below the configured threshold are discarded and neverplaced into the output buffer that is passed to step 707. In step 705,all tags (necessarily below T in the list Z) that are close to T (thatis, whose geospatial distance from T is less than a configured distance,which may or may not be the same as the first specific distance used inmethod 600; or all tags that are inside a specific agreement kernel) arediscarded from the list, and in step 706 tag T is added to an outputbuffer (which starts as an empty buffer before step 701), and tag T isremoved from list Z (note that in most embodiments a “working copy” of Zwould be used in method 700, so the full original Z is maintained foruse elsewhere). Once T has been added to the output buffer and removedfrom Z (or “the working copy of Z”), execution returns to step 702. Thusit will be apparent to one having ordinary skill in the art that theclustering approach of method 700 starts with Z (and gets location datafrom L using the tag identifier in each element of Z), and works downthe list in order of probability (quality), taking each tag T, removingits nearby neighbors from the list, adding T to the output, and removingT from the list until either the list is emptied or the next tag T has aquality that falls below a defined threshold. Thus for each tag T′ inthe output when execution passes to step 707, there is a stronglikelihood that the object specified by tag T′ actually exists, and thatthe output contains no duplicates. It will be apparent that the settingof the “closeness parameter” used in step 705 is an important parameter,since in general if two real objects exist in the region covered by theimage set used, and their real distance is less than the “closenessparameter,” method 700 will likely report only one target in step 707.This would argue for a low value of the closeness parameter; however, avery low value of the closeness parameter would result in many duplicateobjects in the output of step 707 if it is set to a value lower than orclose to the average error in tag location made by users. Fortunately,since the computational cost of methods 600 and 700 is quite low forreasonably sized datasets, it is quite practical for a requesting entityto run the crowdsourced search and locate algorithm (the methods 600 and700) multiple times, with different parameter settings, during a singleanalysis session, to determine an optimal setting for a given campaign(optimality will depend on the type and size of targets sought, imageresolution, participating user experience, and so forth).

Description of Crowdsourcing Method Embodiments

Crowdsourcing has been done in many ways. However, in the case ofcrowdsourcing to obtain data for editing and correcting map data, manyimprovements can be made to the process, thus improving the reliabilityand predictability of maps. For example, ranking the quality of theoutput of each crowdsourcing participant enables the map makers tounderstand the particular skills and abilities of each participant invarious areas, such as, for example, skills and knowledge for urbanareas, for mountain areas, for large infrastructure areas, etc.Additionally, some machine interpretations of the initial image data maybe used to create the framework as a starting point. Additionally, mapdata from other sources may be combined, and the combination presentedto participants. In some cases, participants may get map data to work onwhere already a good map exists to accurately identify how the qualityof said participant's output may compare to the quality of a normalizedaggregate crowdsourcing community output. Of course, the assignment ofimage chips and map data to participants may be randomized to reduce theopportunity to introduce fraudulent or other malice-motivated data intothe system. In other cases, it may desirable to use some other a priorknowledge to assign people to non-random locations. Also, each imagechip is typically sent to a number of participants, which number mayvary from as few as three or five up to more than 100, depending on theimportance and the size and scope of the project.

Comparing the performance of map data annotations by variousparticipants on known areas that already have accurate map data and alsonoting differences in performance on different types of terrains enableshighly accurate ranking of the capabilities of each participant, so thatthe system can determine which participants are best employed on whichtype of terrain, not just in global terms across all terrains, but inrelative terms for different types of imagery. Further, thepreprocessing of the raw imagery enables the system to determine whichparticipants should get which image chips to get the best results in thequickest way.

Other sources of map data may be, for example, existing map systems,open source map systems, commercial or government maps, etc.

The resulting improved maps may be used by government agencies as wellas non-government organizations (NGOs), and commercial organizations toprovide valuable services to areas that don't currently havesufficiently accurate maps and/or infrastructure.

FIG. 9 shows a high-level data flow 900 of the system, in which scalablehosting and processing are followed by a tight quality control loop tokeep the crowd engaged, producing accurate information and verifyingroad data. In step 901 data is acquired during flyovers of vehicles suchas, for example, airplanes, satellites, drones, UAVs, etc. In step 902the acquired data is processed and hosted in a cloud system, whichsystem is described herein earlier and throughout. In step 903particular images are selected to for editing, for example using a mapeditor (although other user interface elements may be used to selectimages for editing, according to the invention). In step 904 theselected data is verified, using CROWDRANK™ VEVS. In step 905 apredictive analysis engine 1101 is used to verify that the previoussteps have been done correctly, and based on the analysis, a communityis ranked and selected. Predictive analysis engine 1101 is a programthat can recognize that a map is coherent. In step 906 a communityselection process is conducted, which may for example assign particularmembers of a community to specific crowdsourcing work (i.e., byassigning them specific images for reviewing, or assigning them to aparticular high-priority campaign, etc.). Assignments may be made basedon various factors in step 906, including for example (but not limitedto) use of a graphical community selection tool by a human campaignadministrator; random assignment of community users; assignment of usersbased on predictive analytics; optimized assignment of users based onanalysis of past performance; and so forth. The process of steps 903through 906 may require several rounds 907 before predictive analysisengine 1101 is satisfied with the results and that the data makes sense.

FIG. 10 shows a verification process 1000 using the CROWDRANK™ VEVS.Open Street Map (OSM) vectors 1001 and image chips 1002 from which theOSM vectors were derived are overlaid on each other. The data is thensent to crowdsourcing participants for the verification process. Regionsare prioritized based on their importance, such as, for example, theirimpact on the humanitarian community. They are also ranked for datareliability. The participants can then edit and correct the map to helpimprove the image, using a crowdsourced image and map data system(CIMDS) 1006. VectorUpdate™ within the crowdsourcing system is part ofRoadTracker, which is a software system to create vectors by followinglinear shapes in images, assuming they are roads (or, secondarily, otherlinear types of infrastructure, including, but not limited to,railroads, pipelines, walls, etc. The vector reliability score 1003 iscalculated by comparing crowdsourced vectors against the calculatedvectors and by incorporating additional information such as crowdagreement, crowd metadata information, and other information about thevector modifications. Vector updates may then be inserted to help fillin recognizable objects and areas, such as roads, geographical features,etc. Crowdsourcing may provide an effective means of validating orcorrecting automated vector updates. The user reliability score 1004 iscalculated by calculating the deviation of a given user from the crowd,to identify the likelihood that certain users may contribute wronginformation. Suspect information is compared to the crowd'sdetermination and then either accepted or rejected, with some notationof it referring to where it should be inserted, noting that if anormally very reliable user has difficulty, the terrain should probablybe considered difficult. Generating a reliability score adds statisticalrigor to the peer review process. The likelihood of these reliabilityscores is based on machine learning. Then the data is assessed fordifficulty 1005 in digitizing that particular region, which is one of aset of chips in an area, based on the degree of accuracy and the spreadof the reliability scores, both for users and for vectors. When thereliability scores are acceptably high, predictive analysis engine 1101is used to increase the predictive analytics capability of the systemand method disclosed herein, as described below.

FIG. 11 shows how predictive analysis engine 1101 (which is the samepredictive analysis engine described earlier in the discussion of step905 in FIG. 9) has all the data together. Various vector fields andother demographic data from various sources are combined into layers,shown, in this example, as layers 1102 through 110 x. More layers arepossible, as indicated by the dashed line between 1104 and 110 x.Predictive analysis engine 1101 combines the layers, based on thereliability scores, and produces predictive map 1006 that contains allthe gathered and validated data. This map may be used for all kinds offurther analyses, both in-house and in the field. A high level analysthas the capabilities required to bring domain and local knowledgetogether for effective prioritization.

FIG. 12 shows the process 1200 of the continuing data editing andcorrections. As described above and throughout, vector reliability score1202, the degree of difficulty of region digitization 1203, userreliability scores 1204, and prediction map 1205 from the system analystare all taken into account in a crowdsourcing targets and memberselection system (CTMS) such as, for example, Community Selector, whichselects prioritized regions 1207 and associated users 1208 (crowdmembers), based on their reliability score, to continue to refine andcorrect data.

FIG. 13 shows a linear process flow of crowdsourced map data cleanup andcorrection system 1300. In step 1301, an application server receivesdata from crowdsourcing participants. In step 1302, the applicationserver uses said data to create image chips for segments of map data tobe created or cleaned up. In step 1303 the server sends an image withany available corresponding data to crowd-sourcing participants, and instep 1304 it receives tagging and/or correction data from crowdsourcingparticipants. In step 1305 the crowdsourced search and locate serverretrieves tags and/or corrections made by crowdsourcing participants byrepeated iterations of steps 1301 through 1304. In step 1306 thecrowdsourced search and locate server computes agreement anddisagreement values for each retrieved tag. The server then in step 1307performs an expectation-maximization or expectation-minimization processiteratively until a configured maximum number of iterations is performedor until an indicia of rate of change between iterations falls below aconfigured threshold. In step 1308 the server then outputs map data toan administrative user. In some cases, the image chips may containthree-dimensional viewable images of an area, aiding crowd-sourcingparticipants to better recognize difficult objects.

The skilled person will be aware of a range of possible modifications ofthe various embodiments described above. Accordingly, the presentinvention is defined by the claims and their equivalents. Variousembodiments of the present disclosure may be implemented in computerhardware, firmware, software, and/or combinations thereof. Methods ofthe present disclosure can be implemented via a computer programinstructions stored on one or more non-transitory computer-readablestorage devices for execution by a processor. Likewise, variousprocesses (or portions thereof) of the present disclosure can beperformed by a processor executing computer program instructions.Embodiments of the present disclosure may be implemented via one or morecomputer programs that are executable on a computer system including atleast one processor coupled to receive data and instructions from, andto transmit data and instructions to, a data storage system, at leastone input device, and at least one output device. Each computer programcan be implemented in any suitable manner, including via a high-levelprocedural or object-oriented programming language and/or via assemblyor machine language. Systems of the present disclosure may include, byway of example, both general and special purpose microprocessors whichmay retrieve instructions and data to and from various types of volatileand/or non-volatile memory. Computer systems operating in conjunctionwith the embodiments of the present disclosure may include one or moremass storage devices for storing data files, which may include: magneticdisks, such as internal hard disks and removable disks; magneto-opticaldisks; and optical disks. Storage devices suitable for tangiblyembodying computer program instructions and data (also called the“non-transitory computer-readable storage media”) include all forms ofnon-volatile memory, including by way of example semiconductor memorydevices, such as EPROM, EEPROM, and flash memory devices; magnetic diskssuch as internal hard disks and removable disks; magneto-optical disks;and CD-ROM disks. Any of the foregoing can be supplemented by, orincorporated in, ASICs (application-specific integrated circuits) andother forms of hardware.

Further, the terms screen, window, display etc. are being used to somedegree interchangeable, as a screen (a set of data) may be presentedwithin a window on a physical screen or display, as well as data may bedisplayed in a window, on a screen.

In some cases, large-scale crowd-sourcing of map data cleanup andcorrection may be done with an application server coupled to a digitalpacket network; with a crowd-rank server stored and operating on anetwork-attached computer and coupled to the application server, andwith a map data server stored and operating on a network-attachedcomputer and coupled to the application server. In such cases, theapplication server may receive connections from crowd-sourcingparticipants, may create so-called “image chips” for segments of mapdata to be created or cleaned up, may send an image with any availablecorresponding data to crowd-sourcing participants, and may receivestagging and/or correction data from crowd-sourcing participants. Inaddition, the crowd-rank server may retrieve tags and/or correctionsmade by participating users; it may compute agreement and disagreementvalues for each retrieved tag; it may perform anexpectation-maximization or expectation-minimization process iterativelyuntil a configured maximum number of iterations is performed or until anindicia of rate of change between iterations falls below a configuredthreshold; and it may output values corresponding to geolocations of mapdata to an administrative user. In some cases, the image chips maycontain three-dimensional viewable images of an area, aidingcrowd-sourcing participants to better recognize difficult objects.

Changes and modifications may be made to the disclosed embodimentswithout departing from the scope of the present disclosure. These andother changes or modifications are intended to be included within thescope of the present disclosure, as expressed in the following claims.

What is claimed is:
 1. A system for large-scale crowd sourcing of mapdata cleanup and correction, comprising: an application servercomprising at least a processor, a memory, and a plurality ofprogramming instructions stored in the memory and operating on theprocessor, wherein the programming instructions, when operating on theprocessor, cause the processor to: select an orthomosaic image of aportion of the Earth's surface corresponding to a particular geographiclocation; automatically select a plurality of smaller images each drawnfrom a portion of the orthomosaic image, at least a portion of theplurality of images being selected such that, when combined, they covera particular area of interest; transmit, over a network, at least aportion of the plurality of smaller images to each of at least two userdevices; receive, over the network, tagging data from at least one ofthe user devices, the tagging data corresponding to a plurality ofobjects and locations identified by the user of the device; provide atleast a plurality of tags to a crowdsourced search and locate server,the tags being based at least in part on received tagging data from atleast a user device; a crowdsourced search and locate server comprisingat least a processor, a memory, and a plurality of programminginstructions stored in the memory and operating on the processor,wherein the programming instructions, when operating on the processor,cause the processor to: receive tagging data corresponding to aplurality of objects and locations from an application server; computeagreement and disagreement values for at least a portion of the taggingdata; perform at least an expectation-maximization analysis processbased at least in part on the computed values; and a map data servercomprising at least a processor, a memory, and a plurality ofprogramming instructions stored in the memory and operating on theprocessor, wherein the programming instructions, when operating on theprocessor, cause the processor to store and provide map data.
 2. Thesystem of claim 1, wherein the image portions contain at least athree-dimensional viewable images of said area, aiding crowdsourcingparticipants to better recognize difficult objects.
 3. The system ofclaim 1, further comprising a client interface application comprising aplurality of programming instructions stored in a memory operating on anetwork-attached computer and adapted to display a plurality ofinteractive elements to a user, receive input from the user, and providethe results of the input to the application server.
 4. The system ofclaim 3, wherein the crowdsourced search and locate server providesanalysis results to the client interface application for display to auser.
 5. A method for conducting crowdsourced search and locateoperations, comprising the steps of: receiving, at an applicationserver, a plurality of communication connections from a plurality ofuser devices via a communication network; navigating a to a particulargeographic location based at least in part on input received from afirst user device; selecting an orthomosaic image of a portion of theEarth's surface corresponding to the particular geographic location;automatically selecting a plurality of smaller images each drawn from aportion of the orthomosaic image, at least a portion of the plurality ofimages being selected such that, when combined, they cover a particulararea of interest; transmitting, over a network, at least a portion ofthe plurality of smaller images to each of at least two user devices;receiving, over a network, tagging data from the first user device, thetagging data corresponding to a plurality of objects and locationsidentified by the user of the device; reducing geolocation error for aplurality of features on the earth by analyzing tagging data pertainingto each respective feature; and updating at least a portion of theorthomosaic image by labeling a plurality of features on the earth, thefeatures being based at least in part on at least a portion of thetagging data.
 6. A method for estimating location and quality of a setof geolocation data, comprising the steps of: receiving, at acrowdsourced search and locate server, tagging data corresponding to aplurality of objects and locations; computing agreement and disagreementvalues for at least a portion of the tagging data; computing maximumlikelihood values for at least a portion of the tagging data, thelikelihood values being based at least in part on the computedagreements and disagreement values; merging a plurality of vectors basedat least in part on the computed likelihood values; and producing finaltag and vector values based at least in part on the results of analysisperformed in previous steps.
 7. The method of claim 6, furthercomprising the steps of: iteratively performing analysis over aplurality of tags and values; and when a threshold is reached, stoppingiteration and producing final values.
 8. The method of claim 7, whereinthe threshold is based at least in part on the quantity of dataremaining for analysis.
 9. The method of claim 7, wherein the thresholdis based at least in part on a value configured by a user.